Semidefinite relaxations for non-convex quadratic mixed-integer programming
نویسندگان
چکیده
منابع مشابه
Semidefinite relaxations for non-convex quadratic mixed-integer programming
We present semidefinite relaxations for unconstrained nonconvex quadratic mixed-integer optimization problems. These relaxations yield tight bounds and are computationally easy to solve for mediumsized instances, even if some of the variables are integer and unbounded. In this case, the problem contains an infinite number of linear constraints; these constraints are separated dynamically. We us...
متن کاملUnbounded convex sets for non-convex mixed-integer quadratic programming
This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some o...
متن کاملSemidefinite Relaxations for Integer Programming
We survey some recent developments in the area of semidefinite optimization applied to integer programming. After recalling some generic modeling techniques to obtain semidefinite relaxations for NP-hard problems, we look at the theoretical power of semidefinite optimization in the context of the Max-Cut and the Coloring Problem. In the second part, we consider algorithmic questions related to ...
متن کاملA Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and by low-rank constraint matrices. We exploit this special structure by solving the dual problem, using a barrier method in combination with a coordinate-wise ...
متن کاملA Semidefinite Programming Method for Integer Convex Quadratic Minimization
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Z. We present a semidefinite programming (SDP) method for obtaining a nontrivial lower bound on the optimal value of the problem. By interpreting the solution to the SDP relaxation probabilistically, we obtain a randomized algorithm for finding good suboptimal solutions. The effectiveness of the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2012
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-012-0534-y